Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model

نویسندگان

چکیده

Abstract Quay cranes are among the most important resources in port terminals, and their efficient use is crucial for terminals to remain competitive market. The problem of determining sequence tasks performed by quay that minimizes turnaround time a vessel an NP‐hard known as crane scheduling (QCSP). In this paper, we consider unidirectional QCSP under uncertain processing times, where only allowed move specific direction. We start presenting first distributionally robust optimization (DRO) model exact decomposition algorithm solve it. proposed DRO makes it possible derive stochastic programming appropriate choice risk‐averse parameter model. Through extensive numerical results, compare these three approaches—stochastic programming, optimization, DRO—to investigate whether significant differences solutions obtained exist. Finally, propose new method helping practitioners determine representative set different solutions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for ...

متن کامل

A Quay Crane Scheduling Model in Container Terminals

This paper discusses the problem of scheduling quay cranes, the most important equipment in port terminals. A simulation model is developed for evaluating time of quay cranes. Then a dynamic scheduling model using objective programming for quay cranes is developed based on genetic algorithm approach. Finally, numerical experiments on a specific container terminal are made for propose approach. ...

متن کامل

Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...

متن کامل

A Timed Petri Net Model For The Quay Crane Scheduling Problem

This paper deals with the problem of constructing the schedule for the operations of a group of quay cranes devoted to discharge/load a set of groups of containers from a vessel at a maritime container terminal. The schedule is constructed starting from the assignment of each individual group of containers to a quay crane under the goal of minimizing the overall vessel completion time, aka the ...

متن کامل

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by inco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Transactions in Operational Research

سال: 2023

ISSN: ['1475-3995', '0969-6016']

DOI: https://doi.org/10.1111/itor.13325